#include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
using namespace std;
class sort
{
public:

};
int main()
{ 
  //priority_queue<int> q;

  {
    q.push(arr[i]);
  }
  cout << q.size() << endl;
  while(q.size())
  {
    cout << q.top() << endl;
    q.pop();
  }

  return 0;
}
